Split Perfect Total Domination of an Interval Graph
نویسندگان
چکیده
A Set S of vertices in a graph G(V,E) is called dominating set,if every vertex v V id either an element or adjacent to S. vertice Total set if S, total G with no isolated subset the such that In this paper we will find perfect Interval graph. We also out induced subgraph regarding which were splitted.
منابع مشابه
DOMINATION NUMBER OF TOTAL GRAPH OF MODULE
Let $R$ be a commutative ring and $M$ be an $R$-module with $T(M)$ as subset, the set of torsion elements. The total graph of the module denoted by $T(Gamma(M))$, is the (undirected) graph with all elements of $M$ as vertices, and for distinct elements $n,m in M$, the vertices $n$ and $m$ are adjacent if and only if $n+m in T(M)$. In this paper we study the domination number of $T(Gamma(M))$ a...
متن کاملdomination number of total graph of module
let $r$ be a commutative ring and $m$ be an $r$-module with $t(m)$ as subset, the set of torsion elements. the total graph of the module denoted by $t(gamma(m))$, is the (undirected) graph with all elements of $m$ as vertices, and for distinct elements $n,m in m$, the vertices $n$ and $m$ are adjacent if and only if $n+m in t(m)$. in this paper we study the domination number of $t(ga...
متن کاملTotal Domination in Interval Graphs Revisited
A set of vertices D is a dominating set of a graph G = (V, E) if every vertex in VD is adjacent to a vertex in D. A set of vertices D is a total-dominating set of a graph G = (V, E) if every vertex in V is adjacent to a vertex in D. The problems of finding a minimum cardinality dominating set or a minimum cardinality totaldominating set are both NP-complete for many classes of graphs [6,2], tho...
متن کاملTotal domination multisubdivision number of a graph
The domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total domination multisubdivision number msdγt(G) of a graph G and we show that for any connected graph G of order at least two, msdγt(G) ≤ 3. We show that...
متن کاملNote: Simultaneous Graph Parameters: Factor Domination and Factor Total Domination
Let F1, F2, . . . , Fk be graphs with the same vertex set V . A subset S ⊆ V is a factor dominating set if in every Fi every vertex not in S is adjacent to a vertex in S, and a factor total dominating set if in every Fi every vertex in V is adjacent to a vertex in S. The cardinality of a smallest such set is the factor (total) domination number. In this note we investigate bounds on the factor ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal For Multidisciplinary Research
سال: 2023
ISSN: ['2582-2160']
DOI: https://doi.org/10.36948/ijfmr.2023.v05i01.1697